Narrow your search

Library

UMons (33)

KU Leuven (26)

UCLouvain (26)

ULiège (24)

ULB (20)

UGent (17)

UAntwerpen (11)

UNamur (8)

KBR (7)

UHasselt (6)

More...

Resource type

book (33)

periodical (1)


Language

English (30)

French (2)

German (1)


Year
From To Submit

2011 (1)

2008 (1)

2006 (1)

2005 (1)

2003 (2)

More...
Listing 1 - 10 of 33 << page
of 4
>>
Sort by
Mathematical logic for computer science
Author:
ISBN: 1852333197 1447103351 9781852333195 Year: 2003 Publisher: London Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

Mathematical Logic for Computer Science is a mathematics textbook with theorems and proofs, but the choice of topics has been guided by the needs of computer science students. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and yet sufficiently elementary for undergraduates. To provide a balanced treatment of logic, tableaux are related to deductive proof systems. The logical systems presented are: - Propositional calculus (including binary decision diagrams); - Predicate calculus; - Resolution; - Hoare logic; - Z; - Temporal logic. Answers to exercises (for instructors only) as well as Prolog source code for algorithms may be found via the Springer London web site: http://www.springer.com/978-1-85233-319-5   Mordechai Ben-Ari is an associate professor in the Department of Science Teaching of the Weizmann Institute of Science. He is the author of numerous textbooks on concurrency, programming languages and logic, and has developed software tools for teaching concurrency. In 2004, Ben-Ari received the ACM/SIGCSE Award for Outstanding Contributions to Computer Science Education.

Algebraic complexity theory
Authors: --- --- ---
ISSN: 00727830 ISBN: 3540605827 3642082289 3662033380 9783540605829 Year: 1997 Volume: 315 Publisher: Berlin: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The algorithmic solution of problems has always been one of the major concerns of mathematics. For a long time such solutions were based on an intuitive notion of algorithm. It is only in this century that metamathematical problems have led to the intensive search for a precise and sufficiently general formalization of the notions of computability and algorithm. In the 1930s, a number of quite different concepts for this purpose were pro­ posed, such as Turing machines, WHILE-programs, recursive functions, Markov algorithms, and Thue systems. All these concepts turned out to be equivalent, a fact summarized in Church's thesis, which says that the resulting definitions form an adequate formalization of the intuitive notion of computability. This had and continues to have an enormous effect. First of all, with these notions it has been possible to prove that various problems are algorithmically unsolvable. Among of group these undecidable problems are the halting problem, the word problem theory, the Post correspondence problem, and Hilbert's tenth problem. Secondly, concepts like Turing machines and WHILE-programs had a strong influence on the development of the first computers and programming languages. In the era of digital computers, the question of finding efficient solutions to algorithmically solvable problems has become increasingly important. In addition, the fact that some problems can be solved very efficiently, while others seem to defy all attempts to find an efficient solution, has called for a deeper under­ standing of the intrinsic computational difficulty of problems.

ESPRIT '89.
Author:
ISBN: 0792305922 9401069689 9400910630 9780792305927 Year: 1989 Volume: 12512 Publisher: Dordrecht Kluwer

The strange logic of random graphs
Author:
ISBN: 3540416544 3642074995 3662045389 9783540416548 Year: 2001 Volume: 22 Publisher: Berlin Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

The study of random graphs was begun by Paul Erdos and Alfred Renyi in the 1960s and now has a comprehensive literature. A compelling element has been the threshold function, a short range in which events rapidly move from almost certainly false to almost certainly true. This book now joins the study of random graphs (and other random discrete objects) with mathematical logic. The possible threshold phenomena are studied for all statements expressible in a given language. Often there is a zero-one law, that every statement holds with probability near zero or near one. The methodologies involve probability, discrete structures and logic, with an emphasis on discrete structures. The book will be of interest to graduate students and researchers in discrete mathematics.

STACS 97 : 14th annual symposium on theoretical aspects of computer science, Lübeck, Germany, February 27-March 1, 1997. Proceedings
Authors: --- ---
ISBN: 3540626166 3540683429 9783540626169 Year: 1997 Volume: 1200 Publisher: Berlin ; Heidelberg ; New York Springer Verlag

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the refereed proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, STACS 97, held in Lübeck, Germany, in February/March 1997. The 46 revised full papers included were carefully selected from a total of 139 submissions; also included are three invited full papers. The papers presented span the whole scope of theoretical computer science. Among the topics covered are, in particular, algorithms and data structures, computational complexity, automata and formal languages, structural complexity, parallel and distributed systems, parallel algorithms, semantics, specification and verification, logic, computational geometry, cryptography, learning and inductive inference.

Squeak : Learn Programming with Robots
Author:
ISBN: 1590594916 9786610700448 1280700440 1430200375 Year: 2005 Publisher: Berkeley, CA : Apress : Imprint: Apress,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Are you completely new to programming? Do you want to have fun learning to program? Squeak: Learn Programming with Robots will teach you core programming concepts based on simple, visual problems that involve manipulation of robots, or "turtles." You will learn basic programming concepts like loops, abstractions, composition, and conditionals. Each chapter is structured so that it can be turned into a one- or two-hour lab session. And while the structured content explains solid principles of object-oriented programming, you'll just have fun going through the sequence of easy examples with the turtle. And be sure to check out BotsInc, the companion learning environment for this book.

Listing 1 - 10 of 33 << page
of 4
>>
Sort by